Minimax flow tree problems
نویسندگان
چکیده
We examine a class of problems which seeks to find tree-structured networks which minimize the maximum cost among a subset of nodes in a graph. The cost metric is characterized by a series of parameters which can represent distance, flow volume, and delivery deadlines. Derived through variations in problem parameters, we present 17 different problems and discuss their worst-case complexity. Fourteen of the problems are new to the literature. We show that some of the problems are NP-complete and others are polynomially solvable.
منابع مشابه
Minimax Network Location: Theory and Algorithms
For a given network let P and N denote the set of all points and the set of all nodes respectively. Let G and T denote a cyclic network and a tree network respectively and let m denote the number of centers available. The categorization scheme {'/{"/m/{ } , where the first and second cells refer to the possible locations of centers and demand generating points respectively, provides for compact...
متن کاملTruncated Linear Minimax Estimator of a Power of the Scale Parameter in a Lower- Bounded Parameter Space
Minimax estimation problems with restricted parameter space reached increasing interest within the last two decades Some authors derived minimax and admissible estimators of bounded parameters under squared error loss and scale invariant squared error loss In some truncated estimation problems the most natural estimator to be considered is the truncated version of a classic...
متن کاملMinimax Trees in Linear Time
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus its depth. Golumbic (1976) introduced minimax trees and gave a Huffman-like, O(n log n)-time algorithm for building them. Drmota and Szpankowski (2002) gave another O(n log n)-time algorithm, which checks the Kraft Inequali...
متن کاملA Note on Minimax Inverse Generalized Minimum Cost Flow Problems
Given a generalized network and a generalized feasible flow f, we consider a problem finding a modified edge cost d such that f is minimum cost with respect to d and the maximum deviation between the original edge cost and d is minimum. This paper shows the relationship between this problem and minimum mean circuit problems and analyze a binary search algorithm for this problem.
متن کاملThe centdian subtree on tree networks
This paper describes an O(n log n) algorithm for 2nding the optimal location of a tree shaped facility of a speci2ed size in a tree network with n nodes, using the centdian criterion: a convex combination of the weighted average distance and the maximum weighted distance from the facility to the demand points (nodes of the tree). These optimization criteria introduced by Halpern, combine the we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 54 شماره
صفحات -
تاریخ انتشار 2009